An Efficient Solution to the Factorized Geometrical Autofocus Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient and Verifiable Solution to the Millionaire Problem

A new solution to the millionaire problem is designed on the base of two new techniques: zero test and batch equation. Zero test is a technique used to test whether one or more ciphertext contains a zero without revealing other information. Batch equation is a technique used to test equality of multiple integers. Combination of these two techniques produces the only known solution to the millio...

متن کامل

An Expressive and Efficient Solution to the Service Selection Problem

Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approaches to solve the service selection problem are required to make these services widely available to the users. In this paper, we propose a framework that is grounded on logic and the Local-As-View approach for represen...

متن کامل

An efficient solution to the informed principal problem

In this paper I study mechanism design by an informed principal. I show that generically this problem has an ex-post efficient solution. In the equilibrium mechanism, the informed principal appropriates all expected social surplus, with each type of her getting all expected social surplus conditional on that type. This outcome is supported as a perfect sequential equilibrium of the informed pri...

متن کامل

Geometrical k-cut Problem and An Optimal Solution for Hypercubes

We introduce a generalization of the (s, t)-cut problem, called the Geometrical k-cut problem, with the concept of geometrical partitioning. A topology graph is employed to represent the geometrical structure of the partitioned nodes of a given k-terminal graph. This problem is NP-hard in general. We propose an optimal algorithm to solve the problem for hypercube topology graphs in polynomial t...

متن کامل

AN ADAPTIVE WAVELET SOLUTION TO GENERALIZED STOKES PROBLEM

In this paper we will present an adaptive wavelet scheme to solvethe generalized Stokes problem. Using divergence free wavelets, theproblem is transformed into an equivalent matrix vector system, thatleads to a positive definite system of reduced size for thevelocity. This system is solved iteratively, where the applicationof the infinite stiffness matrix, that is sufficiently compressible,is r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Geoscience and Remote Sensing

سال: 2016

ISSN: 0196-2892,1558-0644

DOI: 10.1109/tgrs.2016.2550663